Tim Roughgarden - PDFSEARCH.IO - Document Search Engine

Tim Roughgarden
Results: 191

#	Item
131	CS364B: Frontiers in Mechanism Design Lecture #15: The Price of Anarchy of Bayes-Nash Equilibria ∗ Tim Roughgarden† February 26, 2014 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-03-04 01:01:57 Game theory Price of anarchy Nash equilibrium Vickrey auction Solution concept Mechanism design Bayesian game Correlated equilibrium Valuation Sequential auction Generalized second-price auction
132	CS168: The Modern Algorithmic Toolbox Lecture #15 and #16: The Fourier Transform and Convolution Tim Roughgarden & Gregory Valiant∗ May 16, 2016 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-06-04 09:49:43 Fourier analysis Fourier transform Convolution Vector space Discrete Fourier transform Circulant matrix
133	1 Routers with Very Small Buffers Mihaela Enachescu∗ , Yashar Ganjali† , Ashish Goel‡ , Nick McKeown† , and Tim Roughgarden∗ ∗ Department of Computer Science, Stanford University {mihaela, tim}@cs.stanford.e Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2006-01-09 19:38:07 Network performance Transmission Control Protocol Throughput Packet loss Bandwidth-delay product Traffic flow Additive increase/multiplicative decrease FAST TCP TCP congestion control
134	CS369N: Beyond Worst-Case Analysis Lecture #4: Probabilistic and Semirandom Models for Clustering and Graph Partitioning∗ Tim Roughgarden† April 25, 2010 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2011-09-26 19:00:24 NP-complete problems Planted clique Clique problem Clique Graph partition Maximum cut Probability distribution
135	Optimal Efficiency Guarantees for Network Design Mechanisms? Tim Roughgarden??1 and Mukund Sundararajan? ? ?1 Department of Computer Science, Stanford University, 353 Serra Mall, Stanford, CA 94305. Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2007-04-09 01:40:43 Operations research Auction theory Mechanism design Game theory VickreyClarkeGroves mechanism Vickrey auction Optimization problem Mathematical optimization Steiner tree problem Shortest path problem Microeconomics
136	CS168: The Modern Algorithmic Toolbox Lecture #4: Dimensionality Reduction Tim Roughgarden & Gregory Valiant April 8, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-06-04 09:49:43 Machine learning Random projection MinHash Nearest neighbor search K-nearest neighbors algorithm Dimensionality reduction Normal distribution Jaccard index Curse of dimensionality Standard deviation Nonlinear dimensionality reduction
137	CS369N: Beyond Worst-Case Analysis Lecture #1: Instance Optimality∗ Tim Roughgarden† February 19, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2011-09-26 19:00:24 Theoretical computer science Computability theory Algorithm Mathematical logic Algorithms Recursion Function Algorithm characterizations Elliptic curve primality
138	CS168: The Modern Algorithmic Toolbox Lecture #14: Markov Chain Monte Carlo Tim Roughgarden & Gregory Valiant∗ May 11, 2016 The previous lecture covered several tools for inferring properties of the distribution that u Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-06-04 09:49:43 Markov models Markov processes Stochastic processes Monte Carlo methods Statistical mechanics Markov chain Stochastic matrix Markov property Random walk Continuous-time Markov chain Bayesian inference in phylogeny
139	CS364B: Frontiers in Mechanism Design Lecture #16: The Price of Anarchy in First-Price Auctions ∗ Tim Roughgarden† February 26, 2014 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-04-07 01:02:24 Auction theory Game theory Auctions Mechanism design First-price sealed-bid auction Vickrey auction Price of anarchy Auction Nash equilibrium Valuation Sequential auction Generalized second-price auction
140	CS364B: Frontiers in Mechanism Design Lecture #6: Gross Substitutes: Welfare Maximization in Polynomial Time∗ Tim Roughgarden† January 22, 2014 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-02-04 12:04:28 Convex optimization Linear programming Operations research Mathematical optimization Combinatorial optimization Competitive equilibrium Duality Interior point method Ellipsoid method Weak duality VickreyClarkeGroves auction Polynomial

UPDATE